首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   528篇
  免费   12篇
  国内免费   47篇
力学   5篇
综合类   9篇
数学   554篇
物理学   19篇
  2023年   8篇
  2022年   3篇
  2021年   5篇
  2020年   4篇
  2019年   10篇
  2018年   11篇
  2017年   11篇
  2016年   5篇
  2015年   7篇
  2014年   10篇
  2013年   72篇
  2012年   7篇
  2011年   25篇
  2010年   24篇
  2009年   47篇
  2008年   35篇
  2007年   30篇
  2006年   29篇
  2005年   17篇
  2004年   32篇
  2003年   24篇
  2002年   30篇
  2001年   16篇
  2000年   15篇
  1999年   20篇
  1998年   12篇
  1997年   13篇
  1996年   12篇
  1995年   5篇
  1994年   5篇
  1993年   3篇
  1992年   4篇
  1991年   3篇
  1990年   2篇
  1988年   3篇
  1985年   2篇
  1984年   2篇
  1983年   2篇
  1982年   3篇
  1981年   2篇
  1980年   2篇
  1979年   7篇
  1978年   1篇
  1977年   5篇
  1976年   1篇
  1936年   1篇
排序方式: 共有587条查询结果,搜索用时 31 毫秒
1.
2.
3.
A semigroup S is called an equational domain if any finite union of algebraic sets over S is algebraic. We give some necessary and su?cient conditions for a completely simple semigroup to be an equational domain.  相似文献   
4.
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSpace-complete. Additionally, we provide simpler constructions for the uniform word problems of these classes. For the uniform word problem for automaton groups (without rational constraints), we show NL-hardness. Finally, we investigate a question asked by Cain about a better upper bound for the length of a word on which two distinct elements of an automaton semigroup must act differently.A detailed listing of the contributions of this paper can be found at the end of this paper.  相似文献   
5.
借助于广义算子半群和广义积分算子半群的关系,讨论广义算子半群的Perron型指数稳定性,研究了广义积分算子半群的渐近行为.  相似文献   
6.
借助半群的Malcev积和公理化条件,对超富足半群及其子类进行了刻画,给出了超富足半群及其子类的若干特征.  相似文献   
7.
Affine semigroups are convex sets on which there exists an associative binary operation which is affine separately in either variable. They were introduced by Cohen and Collins in 1959. We look at examples of affine semigroups which are of interest to matrix and operator theory and we prove some new results on the extreme points and the absorbing elements of certain types of affine semigroups. Most notably we improve a result of Wendel that every invertible element in a compact affine semigroup is extreme by extending this result to linearly bounded affine semigroups.  相似文献   
8.
9.
In this article, we consider importance sampling (IS) and sequential Monte Carlo (SMC) methods in the context of one-dimensional random walks with absorbing barriers. In particular, we develop a very precise variance analysis for several IS and SMC procedures. We take advantage of some explicit spectral formulae available for these models to derive sharp and explicit estimates; this provides stability properties of the associated normalized Feynman–Kac semigroups. Our analysis allows one to compare the variance of SMC and IS techniques for these models. The work in this article is one of the few to consider an in-depth analysis of an SMC method for a particular model-type as well as variance comparison of SMC algorithms.  相似文献   
10.
In this paper,some properties of quasi-type δ semigroups with an adequate transversal are explored.In particular,abundant semigroups with a cancellative transversal are character-ized.Our results generalize and enrich Saito's results on quasi-orthodox semigroups with an inverse transversal.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号